Monoids and Maximal Codes
نویسنده
چکیده
In recent years codes that are not Uniquely Decipherable (UD) have been studied partitioning them in classes that localize the ambiguities of the code. A natural question is how we can extend the notion of maximality to codes that are not UD. In this paper we give an answer to this question. To do this we introduce a partial order in the set of submonoids of a monoid showing the existence, in this poset, of maximal elements that we call full monoids. Then a set of generators of a full monoid is, by definition, a maximal code. We show how this definition extends, in a natural way, the existing definition concerning UD codes and we find a characteristic property of a monoid generated by a maximal UD code.
منابع مشابه
Recent results on syntactic groups of codes
Finite permutation groups can be considered as building blocks of finite transformation monoids. Indeed, by the Krohn-Rhodes Theorem, any finite transformation monoid divides a semidirect product of permutation groups and three element transformation monoids. Given a transformation monoid M on a finite set, defined by a finite set of generators, it is in general non-trivial to obtain a descript...
متن کاملMonoid generalizations of the Richard Thompson groups
The groups Gk,1 of Richard Thompson and Graham Higman can be generalized in a natural way to monoids, that we call Mk,1, and to inverse monoids, called Invk,1; this is done by simply generalizing bijections to partial functions or partial injective functions. The monoids Mk,1 have connections with circuit complexity (studied in another paper). Here we prove that Mk,1 and Invk,1 are congruence-s...
متن کاملQuivers of monoids with basic algebras
We compute the quiver of any finite monoid that has a basic algebra over an algebraically closed field of characteristic zero. More generally, we reduce the computation of the quiver over a splitting field of a class of monoids that we term rectangular monoids (in the semigroup theory literature the class is known as DO) to representation-theoretic computations for group algebras of maximal sub...
متن کاملOne-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes
We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...
متن کاملPrimitive representations of the polycyclic monoids and branching function systems
We generalise the group theoretic notion of a primitive permutation representation to inverse monoids and so obtain a notion of a primitive representation by partial permutations. Such representations are shown to be determined by what we call essentially maximal proper closed inverse submonoids. Such submonoids in the case of the polycyclic inverse monoids (also known as Cuntz inverse semigrou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011